Complexity of several constraint satisfaction problems using the heuristic, classical, algorithm, WalkSAT
نویسندگان
چکیده
We determine the complexity of several constraint-satisfaction problems using the heuristic algorithm WalkSAT. At large sizes N, the complexity increases exponentially with N in all cases. Perhaps surprisingly, out of all the models studied, the hardest for WalkSAT is the one for which there is a polynomial time algorithm.
منابع مشابه
DE_min_median_loglog.eps
We determine the complexity of several constraint satisfaction problems using the quantum adiabatic algorithm in its simplest implementation. We do so by studying the size dependence of the gap to the first excited state of “typical” instances. We find that at large sizes N , the complexity increases exponentially for all models that we study. We also compare our results against the complexity ...
متن کاملar X iv : 1 10 2 . 51 52 v 1 [ qu an t - ph ] 2 5 Fe b 20 11 Complexity of several constraint satisfaction problems using the heuristic , classical , algorithm , WalkSAT
There is considerable interest, in different fields of science, in finding efficient methods to solve optimization problems. For a few such problems there are clever algorithms which enable one to find the solution, for all cases, in a time which only grows with a power of the size N of the problem. Problems with such a polynomial time algorithm are said to be in the complexity class P. In many...
متن کاملPii: S0004-3702(00)00053-9
GENET is a heuristic repair algorithm which demonstrates impressive efficiency in solving some large-scale and hard instances of constraint satisfaction problems (CSPs). In this paper, we draw a surprising connection between GENET and discrete Lagrange multiplier methods. Based on the work of Wah and Shang, we propose a discrete Lagrangian-based search scheme LSDL, defining a class of search al...
متن کاملSolving Many-Valued SAT Encodings with Local Search
In this paper we present MV-SAT, which is a many-valued constraint programming language that bridges the gap between Boolean Satisfiability and Constraint Satisfaction. Our overall goal is to extend the SAT formalism with many-valued sets and deal with more compact and natural encodings, as in CSP approaches, while retaining the efficiencies of SAT solvers operating on uniform encodings. After ...
متن کاملReformulating Propositional Satissability as Constraint Satisfaction
We study how propositional satissability (SAT) problems can be reformulated as constraint satisfaction problems (CSPs). We analyse four diierent mappings of SAT problems into CSPs. For each mapping , we compare theoretically the performance of systematic algorithms like FC and MAC applied to the encoding against the Davis-Putnam procedure applied to the original SAT problem. We also compare loc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Physical review. E, Statistical, nonlinear, and soft matter physics
دوره 84 1 Pt 1 شماره
صفحات -
تاریخ انتشار 2011